Cutwidth and degeneracy of graphs
نویسنده
چکیده
We prove an inequality involving the degeneracy, the cutwidth and the sparsity of graphs. It implies a quadratic lower bound on the cutwidth in terms of the degeneracy for all graphs and an improvement of it for clique-free graphs.
منابع مشابه
Cutwidth of Split Graphs and Threshold Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Threshold graphs are a well-studied subclass of interval graphs and of split graphs, both of which are unrelated subclasses of chordal graphs. To complement our result, we show that cutwidth is NPcomplete on split graphs, and consequently a...
متن کاملCutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملComputing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, nontrivial polynomial-time cutwidth algorithms were known only for subclasses of graphs of bounded treewidth. Very recently, Heggernes et al. (SIAM J. Discrete Math., 25 (2011), pp. 1418–1437) initiated the study of cutwidth on gra...
متن کاملOn Bandwidth, Cutwidth, and Quotient Graphs
The bandwidth and the cutwidth are fundamental parameters which can give indications on the complexity of many problems described in terms of graphs. In this paper, we present a method for nding general upper bounds for the bandwidth and the cutwidth of a given graph from those of any of its quotient graphs. Moreover, general lower bounds are obtained by using vertex-and edge-bisection notions....
متن کاملMinimal cutwidth linear arrangements of abelian Cayley graphs
We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order. © 2007 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0907.5138 شماره
صفحات -
تاریخ انتشار 2009